Generalized Schur Methods to Computecoprime Factorizations of Rational Matricesa
نویسنده
چکیده
Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices: 1) factorizations with least order denominators; 2) factorizations with inner denominators; and 3) factorizations with proper stable factors. The new algorithms are based on a recursive generalized Schur algorithm for pole assignment. They are generally applicable regardless the original descriptor state space representation is minimal or not, or is stabilizable/detectable or not. The proposed algorithms are useful in solving various computational problems for both standard and descriptor system representations.
منابع مشابه
Generalized Schur Methods to Compute Coprime Factorizations of Rational Matrices
Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices factorizations with least order denominators factorizations with inner denominators and factorizations with proper stable factors The new algorithms are based on a recursive generalized Schur algorithm for pole assignment They are generally applicable regardles...
متن کاملComputation of Coprime Factorizations of Rational Matrices
We propose a numerically reliable state space algorithm for computing coprime factorizations of rational matrices with factors having poles in a given stability domain. The new algorithm is based on a recursive generalized Schur technique for poles dislocation by means of proportional-derivative state feedback. The proposed algorithm is generally applicable regardless the underlying descriptor ...
متن کاملPivoting for Structured Matrices and Rational Tangential Interpolation
Gaussian elimination is a standard tool for computing triangular factorizations for general matrices, and thereby solving associated linear systems of equations. As is well-known, when this classical method is implemented in finite-precision-arithmetic, it often fails to compute the solution accurately because of the accumulation of small roundoffs accompanying each elementary floating point op...
متن کاملUsing the generalized Schur form to solve a multivariate linear rational expectations model
In this paper, I show how to use the generalized Schur form to solve a system of linear expectational di!erence equations (a multivariate linear rational expectations model). The method is simple to understand and to use, and is applicable to a large class of rational expectations models. The only hard part is taken care of by just two standard algorithms, both of which are available as freewar...
متن کامل‘on Schur Algebras and Related Algebras Vi: Some Remarks on Rational and Classical Schur Algebras’
In a recent paper, Dipper and Doty, [2], introduced certain finite dimensional algebras, associated with the natural module of the general linear group and its dual, which they call rational Schur algebras. We give a proof, via tilting modules, that these algebra are in fact generalized Schur algebras. Using the same technique we show that certain finite dimensional algebras with classical grou...
متن کامل